Recursive MIS Computation for Streaming BDPT on the GPU
نویسنده
چکیده
Bidirectional Path Tracing (BDPT) is a robust unbiased rendering algorithm that samples paths by connecting eye and light paths. By optimally combining different sampling strategies using Multiple Importance Sampling (MIS), BDPT efficiently renders scenes with complex light effects. However, BDPT does not map well on a streaming architecture such as the GPU; Stochastic path lengths lead to an uneven workload between BDPT samples and a large memory footprint that depends on the maximum allowed path length. In this paper, we present a streaming alternative to BDPT, called SBDPT. We present a novel scheme for recursively computing balance heuristic MIS weights. This scheme allows for bidirectional connections to be evaluated independently, only requiring data from the light and eye vertex directly involved in the connection. Using this property, we modify the BDPT algorithm to generate a new eye path for each light vertex. The resulting SBDPT algorithm only requires temporary storage for the last vertex on both eye and light paths. Our implementation achieves high performance and has a fixed low memory footprint, independent of the maximum path length.
منابع مشابه
A GPU-based Multi-level Algorithm for Boundary Value Problems
A novel and scalable geometric multi-level algorithm is presented for the numerical solution of elliptic partial differential equations, specially designed to run with high occupancy of streaming processors inside Graphics Processing Units (GPUs). The algorithm consists of iterative, superposed operations on a single grid, and it is composed of two simple full-grid routines: a restriction and a...
متن کاملOptimal Configuration of GPU Cache Memory to Maximize the Performance
GPU devices offer great performance when dealing with algorithms that require intense computational resources. A developer can configure the L1 cache memory of the latest GPU Kepler architecture with different cache size and cache set associativity, per Streaming Multiprocessors (SM). The performance of the computation intensive algorithms can be affected by these cache parameters. In this pape...
متن کاملLot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کاملHIERARCHICAL COMPUTATION OF HERMITE SPHERICAL INTERPOLANT
In this paper, we propose to extend the hierarchical bivariateHermite Interpolant to the spherical case. Let $T$ be an arbitraryspherical triangle of the unit sphere $S$ and let $u$ be a functiondefined over the triangle $T$. For $kin mathbb{N}$, we consider aHermite spherical Interpolant problem $H_k$ defined by some datascheme $mathcal{D}_k(u)$ and which admits a unique solution $p_k$in the ...
متن کاملASC 2 GPU Stream Compilation to Graphics Cards
Modern Graphics Processing Units (GPUs) offer vast acceleration opportunities for general computation as well as for graphics. As an additional acceleration medium the GPU can compete favourably with established media such as FPGAs. In this report we present a system for taking code written as a streaming abstraction and compiling it to run on a GPU. That same code can, with minor changes, be c...
متن کامل